Rewriting in Practice

Orderings and Constraints: Theory and Practice of Proving Termination

In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand the theory of term orderings to develop powerful and widely applicable methods and on the other hand constraint based techniques to put them in practice. In order to show that this program is realizable a constraint-ba...

Modular Rewriting Semantics in Practice

Algebraic Matching of Vulnerabilities in a Low-Level Code

This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...

Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems

Term rewriting systems play an important role in various areas, e.g. in abstract data type speciications, for automated theorem proving and as a basic computation model for functional programming languages. In theory and practice, one of the most important properties of term rewriting systems is the strong normalization or ((nite or uniform) termination property which is undecidable in general....

Extending Graph Rewriting with Copying

The notion of term graph rewrite system (TGRS) is extended with a lazy copying mechanism. By analyzing this mechanism, a connu-ence result is obtained for these so-called copy term graph rewrite systems (C-TGRS). Some ideas on the use of lazy copying in practice are presented .